Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

Q is empty.


↳ QTRS
  ↳ AAECC Innermost

Q restricted rewrite system:
The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

Q is empty.

We have applied [15,7] to switch to innermost. The TRS R 1 is

g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The TRS R 2 is

f(t, x, y) → f(g(x, y), x, s(y))

The signature Sigma is {f}

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G(s(x), s(y)) → G(x, y)
F(t, x, y) → F(g(x, y), x, s(y))
F(t, x, y) → G(x, y)

The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

G(s(x), s(y)) → G(x, y)
F(t, x, y) → F(g(x, y), x, s(y))
F(t, x, y) → G(x, y)

The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

G(s(x), s(y)) → G(x, y)
F(t, x, y) → F(g(x, y), x, s(y))
F(t, x, y) → G(x, y)

The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 1 less node.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                    ↳ QDPOrderProof
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G(s(x), s(y)) → G(x, y)

The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


G(s(x), s(y)) → G(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
G(x1, x2)  =  G(x1)
s(x1)  =  s(x1)

Lexicographic path order with status [19].
Precedence:
s1 > G1

Status:
G1: [1]
s1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ PisEmptyProof
                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ AAECC Innermost
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F(t, x, y) → F(g(x, y), x, s(y))

The TRS R consists of the following rules:

f(t, x, y) → f(g(x, y), x, s(y))
g(s(x), 0) → t
g(s(x), s(y)) → g(x, y)

The set Q consists of the following terms:

f(t, x0, x1)
g(s(x0), 0)
g(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.